Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
451	A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:49:23 Search algorithms Network flow Topological sorting Directed acyclic graph Depth-first search Minor Tree NP-complete problems Spanning tree Graph theory Mathematics Combinatorics
452	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
453	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics
454	CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:06 Analysis of algorithms NP-complete problems Operations research Mathematical optimization Dynamic programming Randomized algorithm Algorithm Time complexity Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics
455	Identification and Estimation of a Discrete Game of Complete Information Patrick Bajari, Han Hong, and Stephen Ryan∗ University of Minnesota and NBER Stanford University MIT and NBER Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2010-12-02 19:46:16 Gaming Nash equilibrium Strategy Trembling hand perfect equilibrium Coordination game Bargaining problem Outcome Best response Solution concept Game theory Problem solving Decision theory
456	An NP-complete Problem for the Abelian Sandpile Model Matthias Schulz Department for Computer Sciences, University of Karlsruhe, Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:37:04 Fuzes Systems theory Bak–Tang–Wiesenfeld sandpile Abelian sandpile model CW complex Grains of Sand Self-organization Topology Mathematics
457	Distributed Computing over Communication Networks: Locality Lower Bounds Stefan Schmid @ T-Labs, 2011 Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:49 Graph coloring NP-complete problems Graph theory Algorithm Distributed computing Time complexity Edge coloring Theoretical computer science Mathematics Applied mathematics
458	The Hand Held Pendant Controller is a revolutionary idea. This pendant can be part of a complete machine tool controller for any type of machine control application. The concept is to provide a system with the Hand Held Add to Reading List Source URL: www.cnccontrols.com Language: English - Date: 2014-12-31 19:58:25 Controller Control theory Science Technology Engineering Computer-aided engineering Numerical control G-code
459	Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1 Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2008-12-19 10:15:00 Applied mathematics Computational complexity theory Quadrilaterals Rectangle Matrix Dominating set Vertex cover Parameterized complexity Clique Theoretical computer science NP-complete problems Mathematics
460	´ Quebec, ´ CCCG 2008, Montreal, August 13–15, 2008 Computational Balloon Twisting: Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:20 Eulerian path Route inspection problem Graph Matching Line graph Hamiltonian path Graph theory Planar graphs NP-complete problems

UPDATE